On the edge-hyper-Hamiltonian laceability of balanced hypercubes
نویسندگان
چکیده
منابع مشابه
On the Enhanced Hyper-hamiltonian Laceability of Hypercubes
A bipartite graph is hamiltonian laceable if there exists a hamiltonian path between any two vertices that are in different partite sets. A hamiltonian laceable graph G is said to be hyperhamiltonian laceable if, for any vertex v of G, there exists a hamiltonian path of G−{v} joining any two vertices that are located in the same partite set different from that of v. In this paper, we further im...
متن کاملHyper hamiltonian laceability on edge fault star graph
The star graph possess many nice topological properties. Edge fault tolerance is an important issue for a network since the edges in the network may fail sometimes. In this paper, we show that the n-dimensional star graph is (n 3)-edge fault tolerant hamiltonian laceable, (n 3)-edge fault tolerant strongly hamiltonian laceable, and (n 4)edge fault tolerant hyper hamiltonian laceable. All these ...
متن کاملFault-tolerant hamiltonian laceability of hypercubes
It is known that every hypercube Qn is a bipartite graph. Assume that n 2 and F is a subset of edges with |F | n− 2. We prove that there exists a hamiltonian path in Qn − F between any two vertices of different partite sets. Moreover, there exists a path of length 2n − 2 between any two vertices of the same partite set. Assume that n 3 and F is a subset of edges with |F | n− 3. We prove that th...
متن کاملAu th or ' s pe rs on al co py Edge - pancyclicity and Hamiltonian laceability of the balanced hypercubes q
The balanced hypercube BHn is a variant of the hypercube Qn. Huang and Wu proved that BHn has better properties than Qn with the same number of links and processors. In particularly, they showed that there exists a cycle of length 2 l in BHn for all l, 2 6 l 6 2n. In this paper, we improve this result by showing that BHn is edge-pancyclic, which means that for arbitrary edge e, there exists a c...
متن کاملHamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
In this paper, we analyze a hypercube-like structure, called the folded hypercube, which is basically a standard hypercube with some extra links established between its nodes. We first show that the n-dimensional folded hypercube is bipartite when n is odd.We also show that the n-dimensional folded hypercube is strongly Hamiltonian-laceable when n is odd, and is Hamiltonian-connected when n = 1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2016
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1908